New Results on Lattice Basis Reduction in Practice
نویسندگان
چکیده
In this paper we introduce several new heuristics as to speed up known lattice basis reduction methods and improve the quality of the computed reduced lattice basis in practice. We analyze substantial experimental data and to our knowledge, we are the first to present a general heuristic for determining which variant of the reduction algorithm, for varied parameter choices, yields the most efficient reduction strategy for reducing a particular problem instance.
منابع مشابه
Practical HKZ and Minkowski Lattice Reduction Algorithms
Recently, lattice reduction has been widely used for signal detection in multiinput multioutput (MIMO) communications. In this paper, we present three novel lattice reduction algorithms. First, using a unimodular transformation, a significant improvement on an existing Hermite-Korkine-Zolotareff-reduction algorithm is proposed. Then, we present two practical algorithms for constructing Minkowsk...
متن کاملBoostReduce - A Framework For Strong Lattice Basis Reduction
In this paper, we propose a new generic reduction framework BoostReduce for strong lattice basis reduction. At the core of our new framework is an iterative method which uses a newly-developed algorithm for finding short lattice vectors and integrating them efficiently into an improved lattice basis. We present BoostBKZ as an instance of BoostReduce using the Block-Korkine-Zolotarev (BKZ) reduc...
متن کاملPractical, Predictable Lattice Basis Reduction
Lattice reduction algorithms are notoriously hard to predict, both in terms of running time and output quality, which poses a major problem for cryptanalysis. While easy to analyze algorithms with good worst-case behavior exist, previous experimental evidence suggests that they are outperformed in practice by algorithms whose behavior is still not well understood, despite more than 30 years of ...
متن کاملConditioning Properties of the LLL Algorithm
Although the LLL algorithm was originally developed for lattice basis reduction, the method can also be used to reduce the condition number of a matrix. In this paper, we propose a pivoted LLL algorithm that further improves the conditioning. Our experimental results demonstrate that this pivoting scheme works well in practice.
متن کاملCommunication Over MIMO Broadcast Channels Using Lattice-Basis Reduction1
A new viewpoint for adopting the lattice reduction in communication over MIMO broadcast channels is introduced. Lattice basis reduction helps us to reduce the average transmitted energy by modifying the region which includes the constellation points. The new viewpoint helps us to generalize the idea of lattice-reduction-aided precoding for the case of unequal-rate transmission, and obtain analy...
متن کامل